Fair and Efficient Variable-length Packet Scheduling and Multilink Transmission Support
نویسندگان
چکیده
منابع مشابه
Distributed Fair Scheduling with Variable Transmission Lengths
The fairness of 802.11 wireless networks is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling algorithm that we call VLS, for “variable-length sch...
متن کاملFair and Efficient Packet Scheduling Using Elastic Round Robin
ÐParallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in the allocation of bandwidth available on a link among traffic flows of different users that share the link. Strict fairness in traffic scheduling can improve the isolation between users, offer a more p...
متن کاملFair and Efficient Packet Scheduling in Wormhole Networks
Most switch architectures for parallel systems are designed to eliminate only the worst kinds of unfairness such as starvation scenarios in which packets belonging to one traffic flow may not make forward progress for an indefinite period of time. However, stricter fairness can lead to a more predictable and better performance, in addition to improving isolation between traffic belonging to dif...
متن کاملFair and Efficient Packet Scheduling Using Resilient Quantum Round-Robin
Round-robin based packet scheduling algorithms are suitable for high-speed networks, but in a variable-length packet environment, this kind of scheduling algorithm need consider packet length to guarantee scheduling fairness. Previous schemes are not perfect for fairness and efficiency. This paper presents a new easily implementable scheduling discipline, called Resilient Quantum Round-Robin (R...
متن کاملHigh-performance variable-length packet scheduling algorithm for IP traffic
A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in inputqueued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better packet latency and similar cell la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2014
ISSN: 1812-5638
DOI: 10.3923/itj.2014.434.442